Fully Arbitrary Control of Frequency-Bin Qubits

Fully Dynamic Bin Packing Revisited

We consider the fully dynamic bin packing problem, where items arrive and depart in an online fashion. The goal is to minimize the number of used bins at every timestep while repacking of already packed items is allowed. Ivković and Lloyd [IL98] have developed an algorithm with asymptotic competitive ratio of 5/4 using O(log n) (amortized) shifting moves whenever an item is inserted or removed ...

Fully Arbitrary Public Announcements

Fully-Dynamic Bin Packing with Limited Repacking

We consider the bin packing problem in a fully-dynamic setting, where new items can arrive and old items may depart. The objective here is to obtain algorithms achieving low asymptotic competitive ratio while changing the packing sparingly between updates. We associate with each item i a movement cost ci ≥ 0. We wish to achieve good approximation guarantees while incurring a movement cost of β ...

It’s a Good Time for Time-Bin Qubits

In contrast to classical bits of information that are either 0or1, quantum bits—or “qubits”—can be in superposition states of 0and1. Just like classical bits, however, qubits are physical objects that have to be implemented in real physical systems. Researchers have used single photons as physical qubits, with the quantum information encoded in terms of polarization, angular momentum, and many ...

Solid State Spin-Wave Quantum Memory for Time-Bin Qubits.

We demonstrate the first solid-state spin-wave optical quantum memory with on-demand read-out. Using the full atomic frequency comb scheme in a Pr(3+):Y2SiO5 crystal, we store weak coherent pulses at the single-photon level with a signal-to-noise ratio >10. Narrow-band spectral filtering based on spectral hole burning in a second Pr(3+):Y2SiO5 crystal is used to filter out the excess noise crea...